0.08/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n022.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 960
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Aug  9 02:25:16 EDT 2022
0.14/0.35	% CPUTime    : 
0.20/0.51	Running higher-order on 8 cores theorem proving
0.20/0.51	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.51	# Version: 3.0pre003-ho
0.20/0.52	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.52	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.52	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.52	# Starting almost_fo_3_lam with 120s (1) cores
0.20/0.52	# Starting post_as_ho1 with 120s (1) cores
0.20/0.52	# ehoh_best2_full_lfho with pid 12409 completed with status 0
0.20/0.52	# Result found by ehoh_best2_full_lfho
0.20/0.52	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.52	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.52	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.52	# No SInE strategy applied
0.20/0.52	# Search class: HGHNS-FFSF11-SHSSMFNN
0.20/0.52	# partial match(1): HHHNS-FFSF11-SHSSMFNN
0.20/0.52	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.52	# Starting new_ho_10 with 65s (1) cores
0.20/0.52	# new_ho_10 with pid 12413 completed with status 0
0.20/0.52	# Result found by new_ho_10
0.20/0.52	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.52	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.52	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.52	# No SInE strategy applied
0.20/0.52	# Search class: HGHNS-FFSF11-SHSSMFNN
0.20/0.52	# partial match(1): HHHNS-FFSF11-SHSSMFNN
0.20/0.52	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.52	# Starting new_ho_10 with 65s (1) cores
0.20/0.52	# Preprocessing time       : 0.001 s
0.20/0.52	# Presaturation interreduction done
0.20/0.52	
0.20/0.52	# Proof found!
0.20/0.52	# SZS status Theorem
0.20/0.52	# SZS output start CNFRefutation
0.20/0.52	thf(decl_22, type, mrel: mworld > mworld > $o).
0.20/0.52	thf(decl_23, type, mactual: mworld).
0.20/0.52	thf(decl_24, type, mlocal: (mworld > $o) > $o).
0.20/0.52	thf(decl_25, type, mnot: (mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_30, type, mbox: (mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_31, type, mdia: (mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_32, type, eiw_di: $i > mworld > $o).
0.20/0.52	thf(decl_33, type, mforall_di: ($i > mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_34, type, mexists_di: ($i > mworld > $o) > mworld > $o).
0.20/0.52	thf(decl_35, type, element: $i > $i > mworld > $o).
0.20/0.52	thf(decl_36, type, esk1_1: mworld > $i).
0.20/0.52	thf(decl_37, type, esk2_0: $i).
0.20/0.52	thf(decl_38, type, esk3_1: $i > $i).
0.20/0.52	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mlocal_def)).
0.20/0.52	thf(mnot_def, axiom, ((mnot)=(^[X2:mworld > $o, X3:mworld]:(~((X2 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mnot_def)).
0.20/0.52	thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mimplies_def)).
0.20/0.52	thf(mequiv_def, axiom, ((mequiv)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)<=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mequiv_def)).
0.20/0.52	thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:(((eiw_di @ X7 @ X3)=>(X6 @ X7 @ X3)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mforall_di_def)).
0.20/0.52	thf(mexists_di_def, axiom, ((mexists_di)=(^[X8:$i > mworld > $o, X3:mworld]:(?[X7:$i]:(((eiw_di @ X7 @ X3)&(X8 @ X7 @ X3)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mexists_di_def)).
0.20/0.52	thf(pel40, conjecture, (mlocal @ (mimplies @ (mexists_di @ (^[X10:$i]:(mforall_di @ (^[X7:$i]:(mequiv @ (element @ X7 @ X10) @ (element @ X7 @ X7)))))) @ (mnot @ (mforall_di @ (^[X11:$i]:(mexists_di @ (^[X12:$i]:(mforall_di @ (^[X13:$i]:(mequiv @ (element @ X13 @ X12) @ (mnot @ (element @ X13 @ X11)))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', pel40)).
0.20/0.52	thf(c_0_7, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.20/0.52	thf(c_0_8, plain, ((mnot)=(^[Z0:mworld > $o, Z1:mworld]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot_def])).
0.20/0.52	thf(c_0_9, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])).
0.20/0.52	thf(c_0_10, plain, ((mequiv)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv_def])).
0.20/0.52	thf(c_0_11, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:(((eiw_di @ X7 @ Z1)=>(Z0 @ X7 @ Z1)))))), inference(fof_simplification,[status(thm)],[mforall_di_def])).
0.20/0.52	thf(c_0_12, plain, ((mexists_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(?[X7:$i]:(((eiw_di @ X7 @ Z1)&(Z0 @ X7 @ Z1)))))), inference(fof_simplification,[status(thm)],[mexists_di_def])).
0.20/0.52	thf(c_0_13, negated_conjecture, ~((?[X24:$i]:(((eiw_di @ X24 @ mactual)&![X23:$i]:(((eiw_di @ X23 @ mactual)=>((element @ X23 @ X24 @ mactual)<=>(element @ X23 @ X23 @ mactual))))))=>~(![X27:$i]:(((eiw_di @ X27 @ mactual)=>?[X26:$i]:(((eiw_di @ X26 @ mactual)&![X25:$i]:(((eiw_di @ X25 @ mactual)=>((element @ X25 @ X26 @ mactual)<=>~(element @ X25 @ X27 @ mactual))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel40])]), c_0_7]), c_0_8]), c_0_9]), c_0_10]), c_0_11]), c_0_12])])).
0.20/0.52	thf(c_0_14, negated_conjecture, ![X38:$i, X39:$i, X41:$i]:((((eiw_di @ esk2_0 @ mactual)&((~(element @ X38 @ esk2_0 @ mactual)|(element @ X38 @ X38 @ mactual)|~(eiw_di @ X38 @ mactual))&(~(element @ X38 @ X38 @ mactual)|(element @ X38 @ esk2_0 @ mactual)|~(eiw_di @ X38 @ mactual))))&(((eiw_di @ (esk3_1 @ X39) @ mactual)|~(eiw_di @ X39 @ mactual))&((~(element @ X41 @ (esk3_1 @ X39) @ mactual)|~(element @ X41 @ X39 @ mactual)|~(eiw_di @ X41 @ mactual)|~(eiw_di @ X39 @ mactual))&((element @ X41 @ X39 @ mactual)|(element @ X41 @ (esk3_1 @ X39) @ mactual)|~(eiw_di @ X41 @ mactual)|~(eiw_di @ X39 @ mactual)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])).
0.20/0.52	thf(c_0_15, negated_conjecture, ![X7:$i]:(((element @ X7 @ esk2_0 @ mactual)|~((element @ X7 @ X7 @ mactual))|~((eiw_di @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.52	thf(c_0_16, negated_conjecture, ![X7:$i, X10:$i]:(((element @ X7 @ X10 @ mactual)|(element @ X7 @ (esk3_1 @ X10) @ mactual)|~((eiw_di @ X7 @ mactual))|~((eiw_di @ X10 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.52	thf(c_0_17, negated_conjecture, ![X7:$i]:(((eiw_di @ (esk3_1 @ X7) @ mactual)|~((eiw_di @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.52	thf(c_0_18, negated_conjecture, ![X7:$i]:(((element @ (esk3_1 @ X7) @ esk2_0 @ mactual)|(element @ (esk3_1 @ X7) @ X7 @ mactual)|~((eiw_di @ X7 @ mactual)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
0.20/0.52	thf(c_0_19, negated_conjecture, (eiw_di @ esk2_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.52	thf(c_0_20, negated_conjecture, ![X7:$i]:(((element @ X7 @ X7 @ mactual)|~((element @ X7 @ esk2_0 @ mactual))|~((eiw_di @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.52	thf(c_0_21, negated_conjecture, (element @ (esk3_1 @ esk2_0) @ esk2_0 @ mactual), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.52	thf(c_0_22, negated_conjecture, ![X7:$i, X10:$i]:((~((element @ X7 @ (esk3_1 @ X10) @ mactual))|~((element @ X7 @ X10 @ mactual))|~((eiw_di @ X7 @ mactual))|~((eiw_di @ X10 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.52	thf(c_0_23, negated_conjecture, ((element @ (esk3_1 @ esk2_0) @ (esk3_1 @ esk2_0) @ mactual)|~((eiw_di @ (esk3_1 @ esk2_0) @ mactual))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.20/0.52	thf(c_0_24, negated_conjecture, ~((eiw_di @ (esk3_1 @ esk2_0) @ mactual)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_21]), c_0_19])])).
0.20/0.52	thf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_17]), c_0_19])]), ['proof']).
0.20/0.52	# SZS output end CNFRefutation
0.20/0.52	# Parsed axioms                        : 30
0.20/0.52	# Removed by relevancy pruning/SinE    : 0
0.20/0.52	# Initial clauses                      : 25
0.20/0.52	# Removed in clause preprocessing      : 15
0.20/0.52	# Initial clauses in saturation        : 10
0.20/0.52	# Processed clauses                    : 24
0.20/0.52	# ...of these trivial                  : 0
0.20/0.52	# ...subsumed                          : 0
0.20/0.52	# ...remaining for further processing  : 24
0.20/0.52	# Other redundant clauses eliminated   : 0
0.20/0.52	# Clauses deleted for lack of memory   : 0
0.20/0.52	# Backward-subsumed                    : 1
0.20/0.52	# Backward-rewritten                   : 0
0.20/0.52	# Generated clauses                    : 11
0.20/0.52	# ...of the previous two non-redundant : 6
0.20/0.52	# ...aggressively subsumed             : 0
0.20/0.52	# Contextual simplify-reflections      : 1
0.20/0.52	# Paramodulations                      : 11
0.20/0.52	# Factorizations                       : 0
0.20/0.52	# NegExts                              : 0
0.20/0.52	# Equation resolutions                 : 0
0.20/0.52	# Propositional unsat checks           : 0
0.20/0.52	#    Propositional check models        : 0
0.20/0.52	#    Propositional check unsatisfiable : 0
0.20/0.52	#    Propositional clauses             : 0
0.20/0.52	#    Propositional clauses after purity: 0
0.20/0.52	#    Propositional unsat core size     : 0
0.20/0.52	#    Propositional preprocessing time  : 0.000
0.20/0.52	#    Propositional encoding time       : 0.000
0.20/0.52	#    Propositional solver time         : 0.000
0.20/0.52	#    Success case prop preproc time    : 0.000
0.20/0.52	#    Success case prop encoding time   : 0.000
0.20/0.52	#    Success case prop solver time     : 0.000
0.20/0.52	# Current number of processed clauses  : 13
0.20/0.52	#    Positive orientable unit clauses  : 4
0.20/0.52	#    Positive unorientable unit clauses: 0
0.20/0.52	#    Negative unit clauses             : 1
0.20/0.52	#    Non-unit-clauses                  : 8
0.20/0.52	# Current number of unprocessed clauses: 2
0.20/0.52	# ...number of literals in the above   : 5
0.20/0.52	# Current number of archived formulas  : 0
0.20/0.52	# Current number of archived clauses   : 11
0.20/0.52	# Clause-clause subsumption calls (NU) : 16
0.20/0.52	# Rec. Clause-clause subsumption calls : 9
0.20/0.52	# Non-unit clause-clause subsumptions  : 1
0.20/0.52	# Unit Clause-clause subsumption calls : 1
0.20/0.52	# Rewrite failures with RHS unbound    : 0
0.20/0.52	# BW rewrite match attempts            : 0
0.20/0.52	# BW rewrite match successes           : 0
0.20/0.52	# Condensation attempts                : 24
0.20/0.52	# Condensation successes               : 0
0.20/0.52	# Termbank termtop insertions          : 2070
0.20/0.52	
0.20/0.52	# -------------------------------------------------
0.20/0.52	# User time                : 0.006 s
0.20/0.52	# System time              : 0.002 s
0.20/0.52	# Total time               : 0.008 s
0.20/0.52	# Maximum resident set size: 1900 pages
0.20/0.52	
0.20/0.52	# -------------------------------------------------
0.20/0.52	# User time                : 0.008 s
0.20/0.52	# System time              : 0.003 s
0.20/0.52	# Total time               : 0.011 s
0.20/0.52	# Maximum resident set size: 1756 pages
0.20/0.52	EOF